An Exact Solution for a Single Machine Scheduling Under Uncertainty
نویسندگان
چکیده
Here we have n jobs on one machine where the processing times are triangular fuzzy numbers. The available to process without interruption. purpose is find a best sequence of that minimizes total completion and maximum tardiness. In this paper new definition presented called D-strongly positive number, then an exact solution problem through found. This opens ideas about converting scheduling problems into cases.
منابع مشابه
Complexity of single machine scheduling problems under scenario-based uncertainty
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...
متن کاملExact algorithms for inventory constrained scheduling on a single machine
This paper focuses on single machine scheduling subject to inventory constraints. Jobs add or remove items to or from the inventory, respectively. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine where the objective is to minimize the total weighted completion time. We develop properties of optimal s...
متن کاملA Single Machine Capacitated Production Planning Problem Under Uncertainty: A Grey Linear Programming Approach
The production planning is an important problem in most of manufacturing systems in practice. Unlike many researches existing in literature, this problem encounters with great uncertainties in parameters and input data. In this paper, a single machine capacitated production planning problem is considered and a linear programming formulation is presented. The production costs are assumed to be u...
متن کاملAn exact approach for scheduling jobs with regular step cost functions on a single machine
This paper studies a single machine scheduling problem whose objective is to minimize a regular step total cost function. Lower and upper bounds, obtained from linear and Lagrangean relaxations of different Integer Linear Programming formulations, are compared. A dedicated exact approach is presented, based on a Lagrangean relaxation. It consists of finding a Constrained Shortest Path in a spec...
متن کاملIntegrated Due Date Setting and Scheduling on a Single Machine Considering an Unexpected Unavailability
In this paper, an integrated machine scheduling withits due date setting problem has been considered. It is assumed that the machine is subject to some kind of random unavailability. Due dates should be set in an attractive and reliable manner, implying that they should be short and possible to be met. To this end, first, long due dates are penalized in the objective function. Then, for each cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jambura Journal of Mathematics
سال: 2023
ISSN: ['2654-5616', '2656-1344']
DOI: https://doi.org/10.34312/jjom.v5i1.16156